Decidability of Equivalence of Symbolic Derivations
Identifieur interne : 003094 ( Main/Exploration ); précédent : 003093; suivant : 003095Decidability of Equivalence of Symbolic Derivations
Auteurs : Yannick Chevalier [France] ; Michaël Rusinowitch [France]Source :
- Journal of Automated Reasoning [ 0168-7433 ] ; 2012-02-01.
English descriptors
- KwdEn :
- mix :
Abstract
Abstract: We give in this paper an alternative, and we believe simpler, proof of a deep result by Mathieu Baudet, namely that the equivalence of symbolic constraints is decidable for deduction systems on a finite signature modulo a subterm convergent equational theory.
Url:
DOI: 10.1007/s10817-010-9199-5
Affiliations:
- France
- Grand Est, Lorraine (région), Midi-Pyrénées, Occitanie (région administrative)
- Toulouse, Vandœuvre-lès-Nancy
- Université Toulouse III - Paul Sabatier
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000D55
- to stream Istex, to step Curation: 000D46
- to stream Istex, to step Checkpoint: 000856
- to stream Hal, to step Corpus: 001A85
- to stream Hal, to step Curation: 001A85
- to stream Hal, to step Checkpoint: 001964
- to stream Main, to step Merge: 003151
- to stream Main, to step Curation: 003094
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Decidability of Equivalence of Symbolic Derivations</title><author><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name></author><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:393E09845F36816D1ABC0D64ECEFEFD21874AC90</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/s10817-010-9199-5</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-SDK3B7CH-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000D55</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000D55</idno><idno type="wicri:Area/Istex/Curation">000D46</idno><idno type="wicri:Area/Istex/Checkpoint">000856</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000856</idno><idno type="wicri:doubleKey">0168-7433:2010:Chevalier Y:decidability:of:equivalence</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00527630</idno><idno type="url">https://hal.inria.fr/inria-00527630</idno><idno type="wicri:Area/Hal/Corpus">001A85</idno><idno type="wicri:Area/Hal/Curation">001A85</idno><idno type="wicri:Area/Hal/Checkpoint">001964</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001964</idno><idno type="wicri:doubleKey">0168-7433:2012:Chevalier Y:decidability:of:equivalence</idno><idno type="wicri:Area/Main/Merge">003151</idno><idno type="wicri:Area/Main/Curation">003094</idno><idno type="wicri:Area/Main/Exploration">003094</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Decidability of Equivalence of Symbolic Derivations</title><author><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>IRIT, Université Paul Sabatier, 118 Route de Narbonne, 31062, Toulouse Cedex 9</wicri:regionArea><placeName><region type="region" nuts="2">Occitanie (région administrative)</region><region type="old region" nuts="2">Midi-Pyrénées</region><settlement type="city">Toulouse</settlement></placeName><orgName type="university">Université Toulouse III - Paul Sabatier</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Loria, Inria Nancy Grand Est, Campus Scientifique, BP 239 54506, Vandœuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Automated Reasoning</title><title level="j" type="abbrev">J Autom Reasoning</title><idno type="ISSN">0168-7433</idno><idno type="eISSN">1573-0670</idno><imprint><publisher>Springer Netherlands</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2012-02-01">2012-02-01</date><biblScope unit="volume">48</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="263">263</biblScope><biblScope unit="page" to="292">292</biblScope></imprint><idno type="ISSN">0168-7433</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0168-7433</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Dolev–Yao model</term><term>Observational equivalence</term><term>Security protocol</term><term>Subterm deduction system</term><term>Symbolic derivation</term></keywords><keywords scheme="mix" xml:lang="en"><term>Dolev-Yao model</term><term>Observational equivalence</term><term>Security protocol</term><term>Subterm deduction system</term><term>Symbolic derivation</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We give in this paper an alternative, and we believe simpler, proof of a deep result by Mathieu Baudet, namely that the equivalence of symbolic constraints is decidable for deduction systems on a finite signature modulo a subterm convergent equational theory.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li><li>Midi-Pyrénées</li><li>Occitanie (région administrative)</li></region><settlement><li>Toulouse</li><li>Vandœuvre-lès-Nancy</li></settlement><orgName><li>Université Toulouse III - Paul Sabatier</li></orgName></list><tree><country name="France"><region name="Occitanie (région administrative)"><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name></region><name sortKey="Chevalier, Yannick" sort="Chevalier, Yannick" uniqKey="Chevalier Y" first="Yannick" last="Chevalier">Yannick Chevalier</name><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003094 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003094 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:393E09845F36816D1ABC0D64ECEFEFD21874AC90
|texte= Decidability of Equivalence of Symbolic Derivations
}}
| This area was generated with Dilib version V0.6.33. |  |